Ramsey problem

#	Item
21	RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:59:20 Logic Theory of computation Congruence lattice problem Mathematics Computability theory Forcing
22	Improved lower bound on an Euclidean Ramsey problem Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-11-06 18:02:30 Graph theory Discrete mathematics Planar graphs Matroid theory Mathematics Graph coloring Theoretical computer science